Parameterized computational complexity of control problems in voting systems
نویسندگان
چکیده
منابع مشابه
Parameterized Control Complexity in Fallback Voting
We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an election. We show that adding and deleting candidates in fallback voting are W[2]-hard for both the constructive and destructive case, parameterized by the amo...
متن کاملParameterized Control Complexity in Bucklin Voting and in Fallback Voting1
We study the parameterized control complexity of Bucklin voting and of fallback voting, a voting system that combines Bucklin voting with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an election. We show that even though the representation of the votes and the winner determination is different, the parameterized complexity ...
متن کاملParameterized Complexity of Geometric Problems
This paper surveys parameterized complexity results for NP-hard geometric problems. Geometric problems arise frequently in application domains as diverse as computer graphics [19], computer vision [4, 35, 43], VLSI design [64], geographic information systems [73, 30], graph drawing [72], and robotics [65, 37], and typically involve (sets of) geometric objects, such as, points, line segments, ba...
متن کاملSystematic Parameterized Complexity Analysis in Computational Phonology
Many computational problems are NP -hard and hence probably do not have fast, i.e., polynomial time, algorithms. Such problems may yet have non-polynomial time algorithms, and the non-polynomial time complexities of these algorithms will be functions of particular aspects of that problem, i.e., the algorithm's running time is upper bounded by f(k)jxjc, where f is an arbitrary function, jxj is t...
متن کاملParameterized complexity analysis in computational biology
Many computational problems in biology involve parameters for which a small range of values cover important applications. We argue that for many problems in this setting, parameterized computational complexity rather than NP-completeness is the appropriate tool for studying apparent intractability. At issue in the theory of parameterized complexity is whether a problem can be solved in time O(n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.04.004